[20250312] BOJ / G3 / 소수의 연속합 / 김수연 #230
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1644
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
연속된 소수의 합으로 N을 나타낼 수 있는 경우의 수 구하기
🔍 풀이 방법
1~N까지 isPrime배열을 생성해서 에라토스테네스의 체를 이용해서 소수여부를 미리 저장해둔다.
이후, 투포인터를 이용해서 더해줄 소수의 범위를 조절해줬다.
⏳ 회고
예외처리를 조금 더 신경써야겠다.